منابع مشابه
Injectivity of Composite Functions
The problem of deciding injectivity of functions is addressed. The functions under consideration are compositions of more basic functions for which information about injectivity properties is available. We present an algorithm which will often be able to prove that such a composite function is injective. This algorithm constructs a set of propositional Horn clause axioms from the function speci...
متن کاملProving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient conditions for injectivity of functions in term rewriting, which are based on program inversion. More precisely, we show that functions defined by non-erasing, convergent and sufficiently complete constructor rewrite s...
متن کاملSome Comments on Injectivity and P-injectivity
A generalization of injective modules (noted GI-modules), distinct from p-injective modules, is introduced. Rings whose p-injective modules are GI are characterized. If M is a left GI-module, E = End(AM), then E/J(E) is von Neumann regular, where J(E) is the Jacobson radical of the ring E. A is semisimple Artinian if, and only if, every left A-module is GI. If A is a left p. p., left GI-ring su...
متن کاملRelative orders and slowly changing functions oriented growth analysis of composite entire functions
In the paper we establish some new results depending on the comparative growth properties of composition of entire functions using relative $L^{ast }$-order (relative $L^{ast }$-lower order) as compared to their corresponding left and right factors where $Lequiv Lleft( rright) $ is a slowly changing function.
متن کاملApproximate Injectivity
In a locally λ-presentable category, with λ a regular cardinal, classes of objects that are injective with respect to a family of morphisms whose domains and codomains are λ-presentable, are known to be characterized by their closure under products, λ-directed colimits and λ-pure subobjects. Replacing the strict commutativity of diagrams by “commutativity up to ε”, this paper provides an “appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1994
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1026